home *** CD-ROM | disk | FTP | other *** search
/ Power Programmierung 2 / Power-Programmierung CD 2 (Tewi)(1994).iso / c / library / dos / diverses / leda / incl / d2_dicti.h < prev    next >
Encoding:
C/C++ Source or Header  |  1991-11-15  |  3.4 KB  |  133 lines
  1. /*******************************************************************************
  2. +
  3. +  LEDA  2.1.1                                                 11-15-1991
  4. +
  5. +
  6. +  d2_dictionary.h
  7. +
  8. +
  9. +  Copyright (c) 1991  by  Max-Planck-Institut fuer Informatik
  10. +  Im Stadtwald, 6600 Saarbruecken, FRG     
  11. +  All rights reserved.
  12. + 
  13. *******************************************************************************/
  14.  
  15.  
  16.  
  17.  
  18. #ifndef D2_DICTIONARY_H
  19. #define D2_DICTIONARY_H
  20.  
  21. #include <LEDA/range_tree.h>
  22.  
  23.  
  24. typedef range_tree_item dic2_item;
  25.  
  26. typedef list(range_tree_item) list(dic2_item);
  27.  
  28.  
  29. // -------------------------------------------------------------------
  30. // 2-dim dictionary
  31. // -------------------------------------------------------------------
  32.  
  33. #define d2_dictionary(type1,type2,itype) name4(type1,type2,itype,d2_dictionary)
  34. #define d2_dict(type1,type2,itype) name4(type1,type2,itype,d2_dict)
  35.  
  36.  
  37. #define d2_dictionarydeclare3(type1,type2,itype)\
  38. \
  39. struct d2_dict(type1,type2,itype) : public range_tree {\
  40. \
  41. void clear_key(ent& x) const  { Clear(*(type1*)&(*(tuplep&)x)[0]);\
  42.                                 Clear(*(type2*)&(*(tuplep&)x)[1]); }\
  43. \
  44. void clear_inf(ent& x) const  { Clear(*(itype*)&(*(tuplep&)x).info());}\
  45. \
  46. void copy_key(ent& x)  const  { Copy(*(type1*)&(*(tuplep)x)[0]);\
  47.                                 Copy(*(type2*)&(*(tuplep)x)[1]); }\
  48. \
  49. void copy_inf(ent& x)  const  { Copy(*(itype*)&(*(tuplep)x).info());}\
  50. \
  51. int cmp_tuple_entry(int i,tuplep p, tuplep q)\
  52. { if (i==1) return compare(*(type1*)&(*p)[0],*(type1*)&(*q)[0]);\
  53.   else      return compare(*(type2*)&(*p)[1],*(type2*)&(*q)[1]);\
  54.  }\
  55. \
  56. range_tree* new_range_tree(int dim)\
  57. { return new d2_dict(type1,type2,itype)(dim); }\
  58. \
  59. type1 key1(dic2_item x)   { return type1((*x)[0]);  }\
  60. type2 key2(dic2_item x)   { return type2((*x)[1]);  }\
  61. itype inf(dic2_item x)    { return itype(x->info());}\
  62. \
  63. void  change_inf(dic2_item x, itype i) { *(itype*)&(x->info()) = i; }\
  64. \
  65. dic2_item min_key1()       { return range_tree::min(1); }\
  66. dic2_item max_key1()       { return range_tree::max(1); }\
  67. dic2_item min_key2()       { return range_tree::min(2); }\
  68. dic2_item max_key2()       { return range_tree::max(2); }\
  69. \
  70. \
  71. dic2_item insert(type1 x,type2 y,itype i)\
  72. { tuplep p = new tuple(Copy(x),Copy(y));\
  73.   p->info() = Copy(i);\
  74.   return range_tree::insert_tuple(p);\
  75.  }\
  76. \
  77. void del(type1 x,type2 y)\
  78. { tuple p(Ent(x),Ent(y));\
  79.   range_tree::del(&p);\
  80.  }\
  81. \
  82. void del_item(dic2_item it)\
  83. { range_tree::del(it);\
  84.  }\
  85. \
  86. list(dic2_item) all_items()\
  87. { return all_tuples();\
  88.  }\
  89. \
  90. list(dic2_item) range_search(type1 x0,type1 x1,type2 y0,type2 y1)\
  91. { list(dic2_item) L;\
  92.   tuple p(Ent(x0),Ent(y0));\
  93.   tuple q(Ent(x1),Ent(y1));\
  94.   range_tree::query_tuples(&p,&q,L);\
  95.   return L;\
  96.  }\
  97. \
  98. dic2_item lookup(type1 x,type2 y)\
  99. { tuple q(Ent(x),Ent(y));\
  100.   q.set_cmp(1);\
  101.   bb_tree_item p=rm_tree::lookup(&q);\
  102.   dic2_item r = ( p ? key(p) : 0);\
  103.   return r;\
  104.  }\
  105. \
  106. d2_dict(type1,type2,itype)(int dim = 2) : range_tree(dim) { }\
  107. \
  108. ~d2_dict(type1,type2,itype)() { clear(); }\
  109. \
  110. } ;\
  111. \
  112. struct d2_dictionary(type1,type2,itype) : public d2_dict(type1,type2,itype) {\
  113. \
  114. list(dic2_item) L;\
  115. \
  116. void init_iteration()\
  117. { L = all_tuples();\
  118.  }\
  119. \
  120. d2_dictionary(type1,type2,itype)()  {}\
  121. ~d2_dictionary(type1,type2,itype)() {}\
  122. \
  123. }; 
  124.  
  125. // --------------------------------------------------------------------
  126. // iteration
  127. // --------------------------------------------------------------------
  128.  
  129. #define forall_dic2_items(x,T)  (T).init_iteration(); forall(x,(T).L )
  130.  
  131.  
  132. #endif
  133.